MODIFICATION OF THE ALGORITHMS OF INTERACTION OF THE DATABASE WITH THE INDEX DATA STRUCTURES 

Frolov Konstantin Mikhailovich, master degree student, sub-department of mathematical support and computer application, Penza State University (40 Krasnaya street, Penza, Russia), kostet150394@mail.ru
Knyazev Victor Nikolaevich, candidate of technical sciences, associate professor, sub-department of mathematical support and computer application, Penza State University (40 Krasnaya street, Penza, Russia), knyazev@sura.ru

004.657

Background. Modern database management system (DBMS) have built-in indexing mechanisms. Data Indexing allows for higher-speed access to the rows of the table by reducing the amount of entries in the index, as well as by organizing index records. Therefore, we are investigating the possibilities of improving the existing index structures and algorithms of interaction with database index data structures are relevant. Purpose – to consider possible modifications to optimize the methods of index structures and operations of a preliminary assessment of the effectiveness of the modified algorithms.
Materials and methods. To evaluate the effectiveness of the modified algorithm to use O-notation, this allows comparing the asymptotic behavior of functions.
Results. Studies obtained modified algorithms for partitioning nodes and remove items, as well as the algorithm of indexing elements for B + trees. For hash tables developed algorithms to add and remove elements that allow for modification of the index structure.
Conclusions. These algorithms allow to realize effective interaction database developed special purpose index data structures. The modified algorithms can achieve an increase in query performance, as well as help to reduce the amount of RAM used in the case of indices, having in the hash table structure.

DBMS, B-tree, hash table, the operation algorithm, query, RAM, storage